Finding Neighbors in Images Represented By Quadtree
نویسندگان
چکیده
In this paper, we propose an algorithm for neighbors finding in images represented by quadtree data structure. We first present a scheme for addressing image pixels that takes into account the order defined on a quadtree blocks. We study various properties of this method, and then we develop a formula that establishes links between quadtree blocks. Based on these results, we present an efficient algorithm that generates the list of location codes of all possible neighbors, in all directions, for a given block of the quadtree.
منابع مشابه
A strategy for repetitive neighbor finding in images represented by quadtrees
The paper presents an effective strategy for repetitive neighbor finding in binary images which is proper for mobile robot path planning, connected component labeling, etc. It is based on a new neighbor finding method which is universal and generates all the possible and arbitrary sized neighbors (larger, smaller, equal) for any quadtree node using simple algebraic operations. © 1997 Elsevier S...
متن کاملParallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors
This paper studies the parallel construction and manipulation of pointer based quadtrees on the hypercube multiprocessor. While parallel algorithms for the manipulation of a variant of linear quadtrees have been previously studied in the literature, no parallel pointer based quadtree construction algorithms have been presented. In this paper, we solve the problem of efficiently constructing poi...
متن کاملCs397 Special Topics in Computer Science Edge Detection through Quadtree
Classical edge detection techniques use various ways of matrix representation of binary images. For large images, time and space requirements of these techniques make them non suitable for any practical applications like remote sensing or processing of fingerprints for commercial transactions. Quadtrees offer an excellent way to store and process an image, with lower space-time requirements. In...
متن کاملNeighbor Finding Techniques for
Image representation plays an important role in image processing applications. Recently there has been a considerable interest in the use of quadtrees. This has led to the development of algorithms for performing image processing tasks as well as for performing converting between the quadtree and other representations. Common to these algorithms is a traversal of the tree and the performance of...
متن کاملIndexation multi-niveaux pour la recherche globale et partielle d'images par le contenu
This article presents a quadtree-based data structure for effective indexing of images. An image is represented by a multi-level feature vector, computed by a recursive decomposition of the image into four quadrants and stored as a full fixed-depth balanced quadtree. A node of the quadtree stores a feature vector of the corresponding image quadrant. A more general quadtree-based structure calle...
متن کامل